Super-Polynomial Versus Half-Exponential Circuit Size in the Exponential Hierarchy
نویسندگان
چکیده
Lower bounds on circuit size were previously established for functions in Σp2, ZPP , Σ exp 2 , ZPEXP NP and MAexp. We investigate the general question: Given a time bound f(n). What is the best circuit size lower bound that can be shown for the classes MA-TIME[f ], ZP-TIME[f ], . . . using the techniques currently known? For the classes MAexp, ZPEXP NP and Σ exp 2 , the answer we get is “halfexponential”. Informally, a function f is said to be half-exponential if f composed with itself is exponential.
منابع مشابه
Lecture 1 : Course Overview and Turing machine complexity
1. Basic properties of Turing Machines (TMs), Circuits & Complexity 2. P, NP, NP-completeness, Cook-Levin Theorem. 3. Hierarchy theorems, Circuit lower bounds. 4. Space complexity: PSPACE, PSPACE-completeness, L, NL, Closure properties 5. Polynomial-time hierarchy 6. #P and counting problems 7. Randomized complexity 8. Circuit lower bounds 9. Interactive proofs & PCP Theorem Hardness of approxi...
متن کاملCircuit Bottom Fan-in and Computational Power the Corresponding Author
We investigate the relationship between circuit bottom fan-in and circuit size when circuit depth is xed. We show that in order to compute certain functions, a moderate reduction in circuit bottom fan-in will cause signiicant increase in circuit size. In particular, we prove that there are functions that are computable by circuits of linear size and depth k with bottom fan-in 2 but require expo...
متن کاملSuperpolynomial Circuits, Almost Sparse Oracles and the Exponential Hierarchy
Several problems concerning superpolynomial size circuits and superpolynomial-time advice classes are investigated. First we consider the implications of NP (and other fundamental complexity classes) having circuits slightly bigger than polynomial. We prove that if such circuits exist, for example if NP has n logn size circuits, the exponential hierarchy collapses to the second level. Next we c...
متن کاملExpander CNFs have Exponential DNNF Size
A negation normal form (NNF) is a circuit on unbounded fanin conjunction (AND) and disjunction (OR) gates, with fanin one negation (NOT) gates applied to input gates only. A NNF is decomposable (DNNF) if, for each AND node, the subcircuits rooted at the children of the node are variable disjoint. We prove an unconditional exponential lower bound on the DNNF size of CNF formulas; thus far, only ...
متن کاملDerandomizing Arthur-Merlin Games
We establish hardness versus randomness trade-oos for Arthur-Merlin games. We create eecient nondeterministic simulations of bounded round Arthur-Merlin games, using a language in exponential time which small circuits cannot decide given access to an oracle for satissability. Our results yield subexponential size proofs for graph nonisomorphism at innnitely many lengths unless the polynomial-ti...
متن کامل